Generalized Gray Codes for Local Rank Modulation
نویسندگان
چکیده
منابع مشابه
On Rank Modulation Codes
We survey rank modulation codes based on a recent result by Mazumdar, Barg and Zemor [MBZ13]. The main results are explicit constructions of rank modulation codes that approach the bounds given by Barg and Mazumdar [BM10].
متن کاملGeneralized Gray Codes with Applications
An efficient algorithm for enumerating a sequence of all elements in (Zn) k in a special order is presented. The sequence enumerated is called the (n,k)-Gray code. It has the property that each pair of adjacent elements differs in only one digit and the difference is either +1 or −1. This sequence can be efficiently applied to calculation of the weight polynomial of a group code. We also show t...
متن کاملGeneralized Gray codes with prescribed ends
An n-bit Gray code is a sequence of all n-bit vectors such that consecutive vectors differ in a single bit. It is well-known that given α, β ∈ {0, 1}, an n-bit Gray code between α and β exists iff the Hamming distance d(α, β) of α and β is odd. We generalize this classical result to k pairwise disjoint pairs αi, βi ∈ {0, 1}: if d(αi, βi) is odd for all i and k < n, then the set of all n-bit vec...
متن کاملLocal Rank Modulation for Flash Memories II
Local rank modulation scheme was suggested recently for representing information in flash memories in order to overcome drawbacks of rank modulation. For 0 < s ≤ t ≤ n with s divides n, an (s, t, n)-LRM scheme is a local rank modulation scheme where the n cells are locally viewed cyclically through a sliding window of size t resulting in a sequence of small permutations which requires less comp...
متن کاملPoint Representation for Local Optimization Towards Multi-Dimensional Gray Codes
In the context of stochastic search, once regions of high performance are found, having the property that small changes in the candidate solution correspond to searching nearby neighborhoods provides the ability to perform effective local optimization. To achieve this, Gray Codes are often employed for encoding ordinal points or discretized real numbers. In this paper, we present a method to la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2268534